Markov Chain Simulation with Fewer Random Samples
نویسندگان
چکیده
منابع مشابه
Markov Chain Simulation with Fewer Random Samples
We propose an accelerated CTMC simulation method that is exact in the sense that it produces all of the transitions involved. We call our method Path Sampling Simulation as it samples from the distribution of trajectories and the distribution of time given some particular trajectory. Sampling from the trajectory space rather than the transition space means that we need to generate fewer random ...
متن کاملDifferential Evolution Markov Chain with snooker updater and fewer chains
Differential Evolution Markov Chain (DE-MC) is an adaptive MCMC algorithm, in which multiple chains are run in parallel. Standard DE-MC requires at least N = 2d chains to be run in parallel, where d is the dimensionality of the posterior. This paper extends DE-MC with a snooker updater and shows by simulation and real examples that DEMC can work for d up to 50–100 with fewer parallel chains (e....
متن کاملMarkov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation
Markov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation by Nathan Boyd Kitchen Doctor of Philosophy in Engineering—Electrical Engineering and Computer Sciences University of California, Berkeley Professor Andreas Kuehlmann, Chair As integrated circuits have grown in size and complexity, the time required for functional verification has become the largest part of total des...
متن کاملCurve Reconstruction with Many Fewer Samples
We consider the problem of sampling points from a collection of smooth curves in the plane, such that the CRUST family of proximity-based reconstruction algorithms can rebuild the curves. Reconstruction requires a dense sampling of local features, i.e., parts of the curve that are close in Euclidean distance but far apart geodesically. We show that ε < 0.47-sampling is sufficient for our propos...
متن کاملMarkov Chain Monte Carlo Random Testing
This paper proposes a software random testing scheme based on Markov chain Monte Carlo (MCMC) method. The significant issue of software testing is how to use the prior knowledge of experienced testers and the information obtained from the preceding test outcomes in making test cases. The concept of Markov chain Monte Carlo random testing (MCMCRT) is based on the Bayes approach to parametric mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2013
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2013.07.012